A Simplicial Algorithm for Stationary Point Problems on Polytopes
نویسندگان
چکیده
منابع مشابه
A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron
A path following algorithm is proposed for finding a solution to the nonlinear stationary point problem on an unbounded, convex and pointed polyhedron. The algorithm can start at an arbitrary point of the polyhedron. The path to be foliowed by the algorithm is described as the path of zeros of some piecewise continuously differentiable function defined on an appropriate subdivided manifold. Thi...
متن کاملA critical index algorithm for nearest point problems on simplicial cones
We consider the linear complementarity problem (q, M) in which M is a positive definite symmetric matrix of order n. This problem is equivalent to a nearest point problem [/'; b] in which F = {A4, ..., A~} is a basis for R", b is a given point in R ' ; and it is required to find the nearest point in the simplicial cone Pos(F) to b. We develop an algorithm for solving the linear complementarity ...
متن کاملA characterization of simplicial polytopes
Kalai proved that the simplicial polytopes with g2 = 0 are the stacked polytopes. We characterize the g2 = 1 case. Specifically, we prove that every simplicial d-polytope (d ≥ 4) which is prime and with g2 = 1 is combinatorially equivalent either to a free sum of two simplices whose dimensions add up to d (each of dimension at least 2), or to a free sum of a polygon with a (d− 2)-simplex. Thus,...
متن کاملTriangulations of Simplicial Polytopes
Various facts about triangulations of simplicial polytopes, particularly those pertaining to the equality case in the generalized lower bound conjecture, are collected together here. They include an apparently weaker restriction on the kind of triangulation which needs to be found, and an inductive argument which reduces the number of cases to be established.
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 1989
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.14.3.383